Equivalent Linear Models to Reduce Computations

Computations for Linear and Generalized Additive Models

Robust and Accurate Inference for Generalized Linear Models: Complete Computations

Normalizable linear orders and generic computations in finite models

Numerous results about capturing complexity classes of queries by means of logical languages work for ordered structures only, and deal with non-generic, or order-dependent, queries. Recent attempts to improve the situation by characterizing wide classes of nite models where linear order is deenable by certain simple means have not been very promising, as certain commonly believed conjectures w...

Using Fewer Processors to Reduce Time Complexities of Semigroup Computations

For parallel algorithms, their execution time consists of two parts: the computation time and the communication time. The execution time reaches a minimum when the other two are balanced. In this paper, we propose a strategy to reduce the execution time when it is dominated by the communication rime. The strategy is to use fewer processors to decrease the communication time and therefore reduce...

Some ways to reduce the space dimension in polyhedra computations

Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double description, consisting of viewing a polyhedron both as the set of solutions of a system of linear inequalities, and as the convex hull of a system of generators, i.e., a set of vertices and rays. The cost of these manipulat...